Formal Verification of Numerical Programs: From C Annotated Programs to Mechanical Proofs
نویسندگان
چکیده
منابع مشابه
Formal Verification of Numerical Programs: From C Annotated Programs to Mechanical Proofs
Numerical programs may require a high level of guarantee. This can be achieved by applying formal methods, such as machine-checked proofs. But these tools handle mathematical theorems while we are interested in C code, in which numerical computations are performed using floating-point arithmetic, whereas proof tools typically handle exact real arithmetic. To achieve this high level of confidenc...
متن کاملFormal veri cation of numerical programs: from C annotated programs to Coq proofs
Numerical programs may require a high level of guarantee. This can be achieved by applying formal methods, such as machinechecked proofs. But these tools handle mathematical theorems while we are interested in C code. To achieve this high level of con dence on C programs, we use a chain of tools: Frama-C, its Jessie plugin, Why and Coq. This requires the C program to be annotated: this means th...
متن کاملFormal Verification of Programs
It is argued that formal verification ofThis paper introduced weakest preconditions.programs, no matter how obtained, will not play the same key role in the development of computer sci-Dijkstra76ence and software engineering as proofs do inDijkstra, E. W. A Discipline of Programming.mathematics. Furthermore the absence of continuity, the inevitability of change, and the ...
متن کاملFormal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic programming in the proof assistant Coq and provide an infrastructure for polytypic proofs. Polytypic functions are reified within Coq as a datatype and they can then be specialized by applying a dependently typed term speci...
متن کاملFormal Verification of 'Programming to Interfaces' Programs
This paper presents a formal approach to specify and verify object-oriented programs written in the 'programming to interfaces' paradigm. Besides the methods to be invoked by its clients, an interface also declares a set of abstract function/predicate symbols, together with a set of constraints on these symbols. For each method declared in this interface, a specification template is given using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2011
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-011-0099-9